58 research outputs found
All-pairs min-cut in sparse networks
Algorithms are presented for the all-pairs min-cut problem in bounded tree-width, planar and sparse networks. The approach used is to preprocess the input -vertex network so that, afterwards, the value of a min-cut between any two vertices can be efficiently computed. A tradeoff is shown between the preprocessing time and the time taken to compute min-cuts subsequently. In particular, after an preprocessing of a bounded tree-width network, it is possible to find the value of a min-cut between any two vertices in constant time. This implies that for such networks the all-pairs min-cut problem can be solved in time . This algorithm is used in conjunction with a graph decomposition technique of Frederickson to obtain algorithms for sparse and planar networks. The running times depend upon a topological property, , of the input network. The parameter varies between 1 and ; the algorithms perform well when . The value of a min-cut can be found in time and all-pairs min-cut can be solved in time for sparse networks. The corresponding running times4 for planar networks are and , respectively. The latter bounds depend on a result of independent interest: outerplanar networks have small ``mimicking'' networks which are also outerplanar
On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version)
We describe algorithms for finding shortest paths and distances in a planar digraph which exploit the particular topology of the input graph. We give both sequential and parallel algorithms that work on a dynamic environment, where the cost of any edge can be changed or the edge can be deleted. For outerplanar digraphs, for instance, the data structures can be updated after any such change in only time, where is the number of vertices of the digraph. The parallel algorithms presented here are the first known ones for solving this problem. Our results can be extended to hold for digraphs of genus
On-line and dynamic algorithms for shortest path problems
We describe algorithms for finding shortest paths and distances in a planar digraph which exploit the particular topology of the input graph. An important feature of our algorithms is that they can work in a dynamic environment, where the cost of any edge can be changed or the edge can be deleted. For outerplanar digraphs, for instance, the data structures can be updated after any such change in only time, where is the number of vertices of the digraph. We also describe the first parallel algorithms for solving the dynamic version of the shortest path problem. Our results can be extended to hold for digraphs of genus
Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
We show how to decompose efficiently in parallel {\em any} graph into a number, , of outerplanar subgraphs (called {\em hammocks}) satisfying certain separator properties. Our work combines and extends the sequential hammock decomposition technique introduced by G.~Frederickson and the parallel ear decomposition technique, thus we call it the {\em hammock-on-ears decomposition}. We mention that hammock-on-ears decomposition also draws from techniques in computational geometry and that an embedding of the graph does not need to be provided with the input. We achieve this decomposition in time using CREW PRAM processors, for an -vertex, -edge graph or digraph. The hammock-on-ears decomposition implies a general framework for solving graph problems efficiently. Its value is demonstrated by a variety of applications on a significant class of (di)graphs, namely that of {\em sparse (di)graphs}. This class consists of all (di)graphs which have a between and , and includes planar graphs and graphs with genus . We improve previous bounds for certain instances of shortest paths and related problems, in this class of graphs. These problems include all pairs shortest paths, all pairs reachability
Quickest paths: faster algorithms and dynamization
Given a network , where , and , is a directed graph, is the capacity and is the lead time (or delay) for each edge , the quickest path problem is to find a path for a given source--destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast data transmissions in communication networks. The best previous algorithm for the single pair quickest path problem runs in time , where is the number of distinct capacities of . In this paper, we present algorithms for general, sparse and planar networks that have significantly lower running times. For general networks, we show that the time complexity can be reduced to , where is at most the number of capacities greater than the capacity of the shortest (with respect to lead time) path in . For sparse networks, we present an algorithm with time complexity , where is a topological measure of . Since for sparse networks ranges from up to , this constitutes an improvement over the previously known bound of in all cases that . For planar networks, the complexity becomes . Similar improvements are obtained for the all--pairs quickest path problem. We also give the first algorithm for solving the dynamic quickest path problem
Enhancing shopping experiences in smart retailing
The retailing market has undergone a paradigm-shift in the last decades, departing from its traditional form of shopping in brick-and-mortar stores towards online shopping and the establishment of shopping malls. As a result, āsmallā independent retailers operating in urban environments have suffered a substantial reduction of their turnover. This situation could be presumably reversed if retailers were to establish business āalliancesā targeting economies of scale and engage themselves in providing innovative digital services. The SMARTBUY ecosystem realizes the concept of a ādistributed shopping mallā, which allows retailers to join forces and unite in a large commercial coalition that generates added value for both retailers and customers. Along this line, the SMARTBUY ecosystem offers several novel features: (i) inventory management of centralized products and services, (ii) geo-located marketing of products and services, (iii) location-based search for products offered by neighboring retailers, and (iv) personalized recommendations for purchasing products derived by an innovative recommendation system. SMARTBUY materializes a blended retailing paradigm which combines the benefits of online shopping with the attractiveness of traditional shopping in brick-and-mortar stores. This article provides an overview of the main architectural components and functional aspects of the SMARTBUY ecosystem. Then, it reports the main findings derived from a 12 months-long pilot execution of SMARTBUY across four European cities and discusses the key technology acceptance factors when deploying alike business alliances
Dynamic connectivity algorithms for Monte Carlo simulations of the random-cluster model
We review Sweeny's algorithm for Monte Carlo simulations of the random
cluster model. Straightforward implementations suffer from the problem of
computational critical slowing down, where the computational effort per edge
operation scales with a power of the system size. By using a tailored dynamic
connectivity algorithm we are able to perform all operations with a
poly-logarithmic computational effort. This approach is shown to be efficient
in keeping online connectivity information and is of use for a number of
applications also beyond cluster-update simulations, for instance in monitoring
droplet shape transitions. As the handling of the relevant data structures is
non-trivial, we provide a Python module with a full implementation for future
reference.Comment: Contribution to the "XXV IUPAP Conference on Computational Physics"
proceedings; Corrected equation 3 and error in the maximal number of edge
level
- ā¦